Approximation algorithms for the recovery of infrastructure after disasters under precedence constraints
نویسندگان
چکیده
منابع مشابه
Approximation Algorithms for Scheduling Jobs with Chain Precedence Constraints
The problem of scheduling jobs with precedence constraints is a central problem in Scheduling Theory which arises in many industrial and scientific applications. In this paper we present a polynomial time approximation scheme for the problem of scheduling jobs with chain precedence constraints on a fixed number of uniformly related machines. Our algorithm works even if we allow “slow” machines ...
متن کاملApproximation Algorithms for Stochastic Machine Scheduling with Precedence Constraints
We consider parallel, identical machine scheduling problems where the jobs are subject to precedence constraints, release dates, and the processing times of jobs are governed by independent probability distributions. The objective is to minimize the expected value of the total weighted completion time ∑w j C j , where w j 0. Building upon a linear programming relaxation by Möhring, Schulz, and ...
متن کاملReview Paper: Indicators of Life Recovery after Disasters and Emergencies
Recovery is a part of disaster management cycle during which repair and reconstruction takes place, and individuals, groups, and communities retake what they have lost and ideally the risk of future incidents reduces. Life recovery is a subjective and multidimensional issue influenced by various factors, whereas valid measurable indicators in evaluating the recovery after di...
متن کاملA monotone approximation algorithm for scheduling with precedence constraints
We provide a monotone O(m)-approximation algorithm for scheduling related machines with precedence constraints.
متن کاملMin-Sum Scheduling Under Precedence Constraints
In many scheduling situations, it is important to consider non-linear functions of job completions times in the objective. This was already recognized by Smith (1956). Recently, the theory community has begun a thorough study of the resulting problems, mostly on single-machine instances for which all permutations of jobs are feasible. However, a typical feature of many scheduling problems is th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IFAC-PapersOnLine
سال: 2019
ISSN: 2405-8963
DOI: 10.1016/j.ifacol.2019.12.154